This paper explores a model where computational procedures themselves are evolved for the development of the next generation of emergent computing. The proposed model is an artificial ecosystem consisting of Turing machines which are a mathematical model of computing or algorithm. These Turing machines interact with each other by reading the other machines' descriptions as an input tape. As the...

Confirmatory factor analysis (CFA) refers to the FA procedure with some loadings constrained be zeros. A difficulty in CFA is that constraint must specified by users a subjective manner. For dealing this difficulty, we propose computational method, which best solution obtained optimally without relying on users’ judgements. The method consists of procedures at lower (L) and higher (H) levels: L...